Uniform multicommodity flows in the hypercube with random edge-capacities
نویسندگان
چکیده
We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge capacities distributed like C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support simultaneous multicommodity flows of volume close to 21−dE[C] between all vertex pairs. Both results are best possible.
منابع مشابه
Uniform multicommodity flow in the hypercube with random edge capacities
We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge-capacities distributed like a random variable C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support sim...
متن کاملUniform multicommodity flow through the complete graph with random edge-capacities
Give random capacities C to the edges of the complete n-vertex graph. Consider the maximum flow Φn that can be simultaneously routed between each source-destination pair. We prove that Φn → φ in probability where the limit constant φ depends on the distribution of C in a simple way, and that asymptotically one need use only oneand two-step routes. The proof uses a reduction to a random graph pr...
متن کاملOptimal Multicommodity Flow through the Complete Graph with Random Edge-capacities
We consider a multicommodity flow problem on a complete graph with the edges having random i.i.d capacities. We show that as the number of nodes tends to infinity, the maximum utility, given by the average of a concave function of each commodity flow, has an almost sure limit. Further, the asymptotically optimal flow uses only direct and two-hop paths, and can be obtained in a distributed manner.
متن کاملApproximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V,E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a set F ⊆ E of edges such that after the removal of the edges in F no pair si−ti is connected by h edge-disjoint paths (i.e., the connectivity of every si− ti pair is at most h− 1 in (V,E\F )). The h-route cut is a natura...
متن کاملPractical Approximation Algorithms for Separable Packing Linear Programs
We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Blocks (GRBB). We extend Fleischer’s improvement [7] of Garg and Könemann [8] fully polynomial time approximation scheme for edge capacitated multicommodity flows to multiterminal multicommodity flows in graphs with capacities on ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 50 شماره
صفحات -
تاریخ انتشار 2017